Provably Secure Security-Enhanced Timed-Release Encryption in the Random Oracle Model

نویسندگان

چکیده

Cryptographic primitive of timed-release encryption (TRE) enables the sender to encrypt a message which only allows designated receiver decrypt after time. Combined with other technologies, TRE technology is applied variety scenarios, including regularly posting on social network and online sealed bidding. Nowadays, in order control decryption time while maintaining anonymity user identities, most solutions adopt noninteractive server mode periodically broadcast trapdoors, but because these trapdoors are generated fixed server’s private key, many “ciphertexts” related key that can be cryptanalyzed generated, poses big challenge confidentiality key. To work this out, we propose concrete scheme generic security-enhanced (SETRE) random oracle model. In our SETRE schemes, use variable numbers together as generate trapdoors. We formalize definition give provably secure construction SETRE. According experiment, proposed reduces computational cost by about 10.8% compared efficient solution model increases almost negligible storage space. Meanwhile, it realizes one-time pad for trapdoor. large extent, security Therefore, enhances efficiency TRE.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Secure Identity-Based Encryption in the Quantum Random Oracle Model

We give the first proof of security for an identity-based encryption scheme in the quantum random oracle model. This is the first proof of security for any scheme in this model that requires no additional assumptions. Our techniques are quite general and we use them to obtain security proofs for two random oracle hierarchical identity-based encryption schemes and a random oracle signature schem...

متن کامل

Simulation-Based Secure Functional Encryption in the Random Oracle Model

One of the main lines of research in functional encryption (FE) has consisted in studying the security notions for FE and their achievability. This study was initiated by [Boneh et al. – TCC’11, O’Neill – ePrint’10] where it was first shown that for FE the indistinguishabilitybased (IND) security notion is not sufficient in the sense that there are FE schemes that are provably IND-Secure but co...

متن کامل

Artemia: a family of provably secure authenticated encryption schemes

Authenticated encryption schemes establish both privacy and authenticity. This paper specifies a family of the dedicated authenticated encryption schemes, Artemia. It is an online nonce-based authenticated encryption scheme which supports the associated data. Artemia uses the permutation based mode, JHAE, that is provably secure in the ideal permutation model. The scheme does not require the in...

متن کامل

Security of Encryption Schemes in Weakened Random Oracle Models

Liskov proposed several weakened versions of the random oracle model, called weakened random oracle models (WROMs), to capture the vulnerability of ideal compression functions, which are expected to have the standard security of hash functions, i.e., collision resistance, second-preimage resistance, and one-wayness properties. The WROMs offer additional oracles to break such properties of the r...

متن کامل

CCA-Secure Hierarchical Identity Based Encryption Without Random Oracle

We consider the problem of constructing a HIBE protocol which is secure in the full model against chosen ciphertext attacks without using random oracle. Known techniques (generic as well as non-generic) convert an (h + 1)-level CPA-secure HIBE protocol into an h-level CCA-secure HIBE protocol. Applied to known constructions, these result in an h-level CCA-secure HIBE whose security degradation ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Security and Communication Networks

سال: 2021

ISSN: ['1939-0122', '1939-0114']

DOI: https://doi.org/10.1155/2021/5593363